Deciding and Axiomatizing St Bisimulation for (interleaving) Nite State Processes

نویسنده

  • Mario Bravetti
چکیده

We propose a technique for expressing the ST semantics in SOS style for terms of a process algebra. This technique, which is based on the idea of giving unique names to actions and reusing the names of terminated actions, allows us to decide and axiomatize weak ST bisimu-lation for all processes that possess a nite state interleaving semantics. Moreover we show that the proposed technique allows for an intuitive deenition of an action reenement operator in term of basic operators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiomatizing St Bisimulation for a Process Algebra with Recursion and Action Reenement (extended Abstract)

Due to the complex nature of bisimulation equivalences which express some form of history dependence, it turned out to be problematic to axiomatize them for non trivial classes of systems. Here we introduce the idea of \compositional level-wise renaming" which gives rise to the new possibility of axiomatizing the class of history dependent bisimulations with slight modiications to the machinery...

متن کامل

Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement

We propose two techniques for expressing the ST semantics for terms of a process algebra. The first technique, which is more intuitive, is based on the idea of giving unique names to actions and allows to decide and axiomatize weak ST bisimulation for all processes that possess a finite state interleaving semantics. The second technique, which is based on pointers, allows to preserve the possib...

متن کامل

A Logical Characterization of Bisimulation for Labeled Markov Processes

This paper gives a logical characterization of probabilistic bisimulation for Markov processes introduced in BDEP97]. The thrust of that work was an extension of the notion of bisimulation to systems with continuous state spaces; for example for systems where the state space is the real numbers. In the present paper we study the logical characterization of probabilistic bisimulation for such ge...

متن کامل

On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)

We study the complexity of the following two relational problems: Let be a binary relation on nite state processes; and let p0 be a xed nite state process. P1: Determine for processes p and q, if p q. P2: Determine for process p, if p p0. We study the complexities of these problems, when processes are represented by sequential transition systems and by parallel composition of transition systems...

متن کامل

An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes

We present an elementary algorithm for deciding bisimulation equivalence between arbitrary context-free processes. This improves on the state of the art algorithm of Christensen, H uttel and Stirling consisting of two semi-decision procedures running in parallel, which prohibits any complexity estimation. The point of our algorithm is the eeective construction of a nite relation characterizing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007